Multi-objective database queries in combined knapsack and set covering problem domains

Abstract Database queries are one of the most important functions a relational database. Users interested in viewing variety data representations, and this may vary based on database purpose nature stored data. The Air Force Institute Technology has approximately 100 logs which will be converted to standardized Scorpion Data Model format. A is designed house its associated sensor non-sensor metadata. Deterministic polynomial-time were used test performance schema against two other schemas, with databases 1000 repeated randomized Of these approaches, that had best was chosen as AFIT’s solution, now more complex useful need developed enable filter research. To end, consider combined Multi-Objective Knapsack/Set Covering Query. Algorithms address Set Problem or Knapsack could individually achieve results, but together they offer additional power potential user. This paper explores NP-Hard problem domain KP/SCP, proposes Genetic Hill Climber algorithms, implements algorithms using Java, populates their structures SQL from databases, finally compares how perform.